Gene Silencing Genetic Algorithm for 0/1 Knapsack with Object Preferences
نویسندگان
چکیده
Genetic Algorithms are efficient search and optimization techniques inspired by natural evolution. To show the difficulties in solving constrained optimization problems through GA, the 0/1 knapsack problem with user specific object preferences has been taken up. A new genetic operator, namely, ‘gene silencing’ inspired from biology is used along with standard GA. The experimental results for varying number of objects and user preferences show that genetic algorithm with gene silencing produces better results when compared to standard GA.
منابع مشابه
Dual Population Genetic Algorithm
The 0/1 Knapsack Problem is an optimization problem solved using various soft computing methods. The solution to the 0/1 Knapsack Problem (KP) can be viewed as the result of a sequence of decisions. Simple Genetic Algorithm (SGA) effectively solves knapsack problem for large data set. But it has problems like premature convergence and population diversity. Dual Population Genetic Algorithm (DPG...
متن کاملA Robust Knapsack Based Constrained Portfolio Optimization
Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...
متن کاملA Novel Genetic Algorithm using Helper Objectives for the 0-1 Knapsack Problem
The 0-1 knapsack problem is a well-known combinatorial optimisation problem. Approximation algorithms have been designed for solving it and they return provably good solutions within polynomial time. On the other hand, genetic algorithms are well suited for solving the knapsack problem and they find reasonably good solutions quickly. A naturally arising question is whether genetic algorithms ar...
متن کاملGenetic Algorithm with Directional Mutation Based on Greedy Strategy for Large-scale 0-1 Knapsack Problems
In view of the lack of efficiency or accuracy of solving large-scale 0-1 knapsack problems by the classic genetic algorithm, a directional mutation operator is designed to reduce the probability of resampling in the search process. Meanwhile an initializing operator and an individual correction operator are added to the algorithm to modify individual after every amendment, both of which are com...
متن کاملSimulated Annealing for the 0/1 Multidimensional Knapsack Problem
In this paper a simulated annealing (SA) algorithm is presented for the 0/1 multidimensional knapsack problem. Problem-specific knowledge is incorporated in the algorithm description and evaluation of parameters in order to look into the performance of finite-time implementations of SA. Computational results show that SA performs much better than a genetic algorithm in terms of solution time, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Computational Intelligence Systems
دوره 4 شماره
صفحات -
تاریخ انتشار 2011